Chaos-Based Bitwise Dynamical Pseudorandom Number Generator On FPGA

FPGA acceleration of a pseudorandom number generator based on chaotic iterations

As any well-designed information security application uses a very large quantity of good pseudorandom numbers, inefficient generation of these numbers can be a significant bottleneck in various situations. In previous research works, a technique that applies welldefined discrete iterations, satisfying the reputed Devaney’s definition of chaos, has been developed. It has been proven that the gen...

FPGA Design for Pseudorandom Number Generator Based on Chaotic Iteration used in Information Hiding Application

Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable fixed-point method for random streams generation. In our previous researches, we have proposed a technique by applying some well-defined discrete chaotic iterations...

MUGI Pseudorandom Number Generator

On a nonlinear congruential pseudorandom number generator

A nonlinear congruential pseudorandom number generator with modulus M = 2w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.

Yet Another Pseudorandom Number Generator

We propose a novel pseudorandom number generator based on Rössler attractor and bent Boolean function. We estimated the output bits properties by number of statistical tests. The results of the cryptanalysis show that the new pseudorandom number generation scheme provides a high level of data security. Keywords—Rössler attractor, bent Boolean function, pseudorandom number generator.